Arity Raiser and its Use in Program Specialization
نویسنده
چکیده
Experiments on generating compilers by specializing specializers with respect to interpreters have shown that the compilers thus obtained have a natural structure only if the specializer does variable splitting. Variable splitting can result in a residual program using several variables to represent the values of a single variable of the original program. In the case of functional programming variable splitting is done by raising the arities of functions. The paper describes the structure and principles of operation of an arity raiser dealing with programs in a subset of pure Lisp.
منابع مشابه
Undecidable Boundedness Problems for Datalog Programs
A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was rst demonstrated by Gaifman et al. We introduce new techniques for proving the undecidability of various kinds of boundedness, which allow us to considerably strengthen t...
متن کاملHigher-Order Redundancy Elimination
Functional programs often de ne functions by pat tern matching where patterns may inadvertedly overlap through successive function calls This leads to hidden in e ciencies since the recursively called function possibly repeats redundant tests while trying to match the pat tern An analysis which is based on conservative symbolic execution similar to higher order constant propagation is proposed ...
متن کاملComparative Study of the Educational Program of Military Nursing in Iran, USA, India
Background and Aim: In order to promote military nursing education in Iran, it is necessary to conduct comparative studies and use the strategies experienced in universities in other countries. The present study has a descriptive and comparative comparison of military nursing education programs in three countries: Iran, the United States and India. Methods: A comparative and descriptive-analyti...
متن کاملOn Optimization of Monadic Logic Programs
The article is devoted to the optimization of monadic logic programs and goals (programs and goals, which do not use functional symbols of arity > 1 and use only predicate symbols of arity 1). A program P is terminating with respect to a goal G, if an SLD-tree of P and G is finite. In general, monadic programs are not terminating. Program and goal transformations are introduced, by which a mona...
متن کاملSub-tree Swapping Crossover and Arity Histogram Distributions
Recent theoretical work has characterised the search bias of GP subtree swapping crossover in terms of program length distributions, providing an exact fixed point for trees with internal nodes of identical arity. However, only an approximate model (based on the notion of average arity) for the mixed-arity case has been proposed. This leaves a particularly important gap in our knowledge because...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990